Fourier Knots
نویسنده
چکیده
This paper introduces the concept of Fourier knot. A Fourier knot is a knot that is represented by a parametrized curve in three dimensional space such that the three coordinate functions of the curve are each finite Fourier series in the parameter. That is, the knot can be regarded as the result of independent vibrations in each of the coordinate directions with each of these vibrations being a linear combination of a finite number of pure frequencies.
منابع مشابه
Sampling Lissajous and Fourier Knots
A Lissajous knot is one that can be parameterized as K(t) = (cos(nxt+ φx), cos(nyt+ φy), cos(nzt+ φz)) where the frequencies nx, ny , and nz are relatively prime integers and the phase shifts φx, φy and φz are real numbers. Lissajous knots are highly symmetric, and for this reason, not all knots are Lissajous. We prove several theorems which allow us to place bounds on the number of Lissajous k...
متن کاملThe Budan-fourier Theorem and Hermite-birkhoff Spline Interpolation
We extend the classical Budan-Fourier theorem to Hermite-Birkhoff splines, that is splines whose knots are determined by a finite incidence matrix. This is then applied to problems of interpolation by Hermite-Birkhoff splines, where the nodes of interpolation are also determined by a finite incidence matrix. For specified knots and nodes in a finite interval, conditions are examined under which...
متن کاملMoments and Fourier transforms of B-splines
The problem o f determining the moments and the Fourier transforms o f B-splines with arbitrary knots is considered. There exists a simple connect ion between the moments o f such splines and the so-called extended Stirling numbers o f the second kind which are defined in section 2. Some recurrence relations for the moments o f B-splines with arbitrary knots are given in section 3. In the case ...
متن کاملFast and stable algorithms for discrete spherical Fourier transforms
In this paper, we propose an algorithm for the stable and eecient computation of Fourier expansions of square integrable functions on the unit sphere S R 3 , as well as for the evaluation of these Fourier expansions at special knots. The heart of the algorithm is an eecient realization of discrete Legendre function transforms based on a modiied and stabilized version of the Driscoll{Healy algor...
متن کاملFast Gauss transforms with complex parameters using NFFTs
at the target knots yj ∈ [−14 , 1 4 ], j = 1, . . . ,M , where σ = a + ib, a > 0, b ∈ R denotes a complex parameter. Fast Gauss transforms for real parameters σ were developed, e.g., in [15, 8, 9]. In [12], we have specified a more general fast summation algorithm for the Gaussian kernel. Recently, a fast Gauss transform for complex parameters σ with arithmetic complexity O(N log N + M) was int...
متن کامل